Multi-objective Analysis of Approaches to Dynamic Routing of a Vehicle

نویسندگان

  • Christian Grimme
  • Stephan Meisel
  • Heike Trautmann
  • Günter Rudolph
  • Martin Wölck
چکیده

We consider a routing problem for a single vehicle serving customer locations in the course of time. A subset of these customers must necessarily be served, while the complement of this subset contains dynamic customers which request for service over time, and which do not necessarily need to be served. The decision maker’s conflicting goals are serving as many customers as possible as well as minimizing total travel distance. We solve this bi-objective problem with an evolutionary multi-objective algorithm in order to provide an a-posteriori evaluation tool for enabling decision makers to assess the single-objective solution strategies that they actually use in real-time. We present the modifications to be applied to the evolutionary multi-objective algorithm NSGA2 in order to solve the routing problem, we describe a number of real-time single-objective solution strategies, and we finally use the gained efficient trade-off solutions of NSGA2 to exemplarily evaluate the real-time strategies. Our results show that the evolutionary multi-objective approach is well-suited to generate benchmarks for assessing dynamic heuristic strategies. Our findings point into future directions for designing dynamic multi-objective approaches for the vehicle routing problem with time windows.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A multi-objective memetic algorithm for risk minimizing vehicle routing problem and scheduling problem

In this paper, a new approach to risk minimizing vehicle routing and scheduling problem is presented. Forwarding agents or companies have two main concerns for the collection of high-risk commodities like cash or valuable commodities between the central depot and the customers: one; because of the high value of the commodities transported, the risk of ambush and robbery are very high. Two; the ...

متن کامل

A time-dependent vehicle routing problem for disaster response phase in multi-graph-based network

Logistics planning in disaster response phase involves dispatching commodities such as medical materials, personnel, food, etc. to affected areas as soon as possible to accelerate the relief operations. Since transportation vehicles in disaster situations can be considered as scarce resources, thus, the efficient usage of them is substantially important. In this study, we provide a dynamic vehi...

متن کامل

A New Competitive Approach on Multi-Objective Periodic Vehicle Routing Problem

This paper presents a novel multi-objective mathematical model of a periodic vehicle routing problem (PVRP) in a competitive situation for obtaining more sales. In such a situation, the reaching time to customers affects the sale amount therefore, distributors intend to service customers earlier than other rivals for obtaining the maximum sale. Moreover, a partial driver’s benefit is related...

متن کامل

Solving a Bi-Objective Multi-Product Vehicle Routing Problem with Heterogeneous Fleets under an Uncertainty Condition

This paper presents a novel bi-objective multi-product capacitated vehicle routing problem with uncertainty in demand of retailers and volume of products (UCVRP) and heterogeneous vehicle fleets. The first of two conflict fuzzy objective functions is to minimize the cost of the used vehicles, fuel consumption for full loaded vehicles and shortage of products. The second ...

متن کامل

A new Bi-objective model for a Two-echelon Capacitated Vehicle Routing Problem for Perishable Products with the Environmental Factor

In multi-echelon distribution strategy freight is delivered to customers via intermediate depots. Rather than using direct shipments, this strategy is an increasingly popular one in urban logistics. This is primarily to alleviate the environmental (e.g., energy usage and congestion) and social (e.g., traffic-related air pollution, accidents and noise) consequences of logistics operations. This ...

متن کامل

Comparing Two-Echelon and Single-Echelon Multi-Objective Capacitated Vehicle Routing Problems

This paper aims to compare a two-echelon and a single-echelon distribution system. A mathematical model for the Single-Echelon Capacitated Vehicle Routing Problem (SE-CVRP) is proposed. This SE-CVRP is the counterpart of Two-Echelon Capacitated Vehicle Routing Problem (2E-CVRP) introduced in the authors’ previous work. The proposed mathematical model is Mixed-Integer Non-Linear Programming (MIN...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015